IN THIS PAPER, A COMBINATORIAL PROCUREMENT AUCTION MECHANISM IS PROPOSED FOR DETERMINING THE BEST SUPPLIERS AMONG A SET OF POTENTIAL SUPPLIERS FOR A MANUFACTURING COMPANY. THROUGH THIS MECHANISM, THE TASK OF SUPPLYING EACH REQUIRED ITEM IS ASSIGNED TO ONLY ONE POTENTIAL SUPPLIER. THE CORRESPONDING WINNER DETERMINATION PROBLEM IS FORMULATED AS A COMBINATORIAL OPTIMIZATION PROBLEM. HOWEVER, EVEN FINDING A FEASIBLE SOLUTION FOR THE FORMULATED PROBLEM IS NP-COMPLETE. SINCE EXACT METHODS ARE FAILED IN SOLVING THIS KIND OF PROBLEMS, A PROBLEM-SPECIFIC GENETIC ALGORITHM IS DEVELOPED TO ESTIMATE THE OPTIMAL SOLUTION(S) OF WINNER DETERMINATION PROBLEM. THE PERFORMANCE OF THE PROPOSED GENETIC ALGORITHM IS EVALUATED BY SOLVING A SET OF RANDOMLY GENERATED INSTANCES OF PROBLEM. COMPUTATIONAL RESULTS SHOW THAT THE GENETIC ALGORITHM PERFORMS WELL IN FINDING FEASIBLE SOLUTIONS AND ESTIMATING OPTIMAL SOLUTION(S) OF PROBLEM INSTANCES.